#ifndef __M_ROUTE_H__
#define __M_ROUTE_H__
#include <iostream>
#include "../mqcommon/mq_logger.hpp"
#include "../mqcommon/mq_helper.hpp"
#include "../mqcommon/mq_msg.pb.h"

namespace bitmq
{
    class Route
    {
    public:
        static bool isLegalRoutingKey(const std::string &routing_key)
        {
            // routing_key:只需要判断是否包含非法字符即可，合法字符（a~z,A~Z,0~9,.,）
            for (auto &ch : routing_key)
            {
                if ((ch >= 'a' && ch <= 'z') ||
                    (ch >= 'A' && ch <= 'Z') ||
                    (ch >= '0' && ch <= '9') ||
                    (ch == '_' || ch == '.'))
                {
                    continue;
                }
                return false;
            }
            return true;
        }
        static bool isLegalBindingKey(const std::string &binding_key)
        {
            //*和#必须独立存在且不能连续存在
            for (auto &ch : binding_key)
            {
                if ((ch >= 'a' && ch <= 'z') ||
                    (ch >= 'A' && ch <= 'Z') ||
                    (ch >= '0' && ch <= '9') ||
                    (ch == '_' || ch == '.') ||
                    (ch == '*' || ch == '#'))
                {
                    continue;
                }
                return false;
            }

            std::vector<std::string> sub_words;
            StrHelper::split(binding_key, ".", sub_words);
            for (auto &word : sub_words)
            {
                if (word.size() > 1 && (word.find("*") != std::string::npos || word.find(".") != std::string::npos))
                {
                    return false;
                }
            }

            for (int i = 1; i < sub_words.size(); i++)
            {
                if (sub_words[i] == "#" && (sub_words[i - 1] == "#" || sub_words[i - 1] == "*"))
                {
                    return false;
                }
                if (sub_words[i] == "*" && sub_words[i - 1] == "#")
                {
                    return false;
                }
            }
            // for (int i = 1; i < sub_words.size(); i++)
            return true;
        }
        static bool route(ExchangeType type, const std::string &routing_key, const std::string &binding_key)
        {
            if (type == ExchangeType::DIRECT)
            { // 直接交换
                return (routing_key == binding_key);
            }
            else if (type == ExchangeType::FANOUT)
            { // 广播交换
                return true;
            }
            else
            { // 主题交换
                // 1.将binding_key与routing_key进行字符串分割，得到各个的单词数组
                std::vector<std::string> bkeys, rkeys;
                int n_bkey = StrHelper::split(binding_key, ".", bkeys);
                int n_rkey = StrHelper::split(routing_key, ".", rkeys);

                // 2.定义标记数组，初始化dp[0][0]为true
                std::vector<std::vector<bool>> dp(n_bkey + 1, std::vector<bool>(n_rkey + 1, false));
                dp[0][0] = true;
                // 3.如果binding_key以#开始，则将对应行的第0列置为1
                for (int i = 1; i <= bkeys.size(); i++)
                {
                    if (bkeys[i - 1] == "#")
                    {
                        dp[i][0] = true;
                        continue;
                    }
                    break;
                }

                // 4.使用routing_key中每个单词与binding_key中的每个单词进行匹配并标记
                for (int i = 1; i <= n_bkey; i++)
                {
                    for (int j = 1; j <= n_rkey; j++)
                    {
                        if (bkeys[i - 1] == rkeys[j - 1] || bkeys[i - 1] == "*")
                        {
                            dp[i][j] = dp[i - 1][j - 1];
                        }
                        else if (bkeys[i - 1] == "#")
                        {
                            dp[i][j] = dp[i - 1][j - 1] | dp[i][j - 1] | dp[i - 1][j];
                        }
                    }
                }
                return dp[n_bkey][n_rkey];
            }
        }
    };
}

#endif